ProTraS: A probabilistic traversing sampling algorithm
نویسندگان
چکیده
منابع مشابه
Traversing Probabilistic Graphs
The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are probabilistic in nature. A probabilistic graph is one where there is a probability associated with the existence of every edge. We examine the problem of nding the best strategy for reaching a give...
متن کاملSampling Without Probabilistic Model
In this paper a novel technique for random vector sampling starting from rare data is presented. This model-free sampling technique is developed to operate without a probabilistic model. Instead of estimating a distribution function, the information contained in a given small sample is extracted directly to produce the sampling result as a second sample of considerably larger size that complete...
متن کاملA Probabilistic Counting Algorithm
This talk1 (a joint work with Philippe Flajolet) presents an algorithm to approximate count the number of different words in very large sets or texts (in the range of billions of bytes) and its analysis. When using an auxiliary memory of m bytes, the accuracy is of the order 1/ √ m. The analysis of this new algorithm relies on asymptotic Depoissonization techniques.
متن کاملImportance Sampling Based Probabilistic EigenTracker
Tracking objects over the video frames finds many applications in surveillance [13], human activity analysis [4] and gesture recognition [6],[12]. It becomes a very challenging task if the appearence and the dynamics of the object varies over successive frames. It becomes important to include elements of nonlinearity and non-Gaussianity in order to model accurately the underlying dynamics of a ...
متن کاملSlice Sampling for Probabilistic Programming
We introduce the first, general purpose, slice sampling inference engine for probabilistic programs. This engine is released as part of StocPy, a new Turing-Complete probabilistic programming language, available as a Python library. We present a transdimensional generalisation of slice sampling which is necessary for the inference engine to work on traces with different numbers of random variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2018
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2018.03.052